Quantum random access memory via quantum walk

Quantum Random Walk via Classical Random Walk With Internal States

In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...

Energy Efficient Novel Design of Static Random Access Memory Memory Cell in Quantum-dot Cellular Automata Approach

This paper introduces a peculiar approach of designing Static Random Access Memory (SRAM) memory cell in Quantum-dot Cellular Automata (QCA) technique. The proposed design consists of one 3-input MG, one 5-input MG in addition to a (2×1) Multiplexer block utilizing the loop-based approach. The simulation results reveals the excellence of the proposed design. The proposed SRAM cell achieves 16% ...

Search via Quantum Walk

What is Quantum Random Walk?

• Classical: random walk in one dimension describes a particle that moves in the positive or negative direction according to the random outcome of some unbiased binary variable (e.g., a fair coin). • Quantum: The particle with two degree of freedom (for example spin) can move left or right according to its spin and one unitary operator can play coin roles (for example Hadamard operator).In quan...

Two-dimensional quantum random walk

We analyze several families of two-dimensional quantum random walks. The feasible region (the region where probabilities do not decay exponentially with time) grows linearly with time, as is the case with one-dimensional QRW. The limiting shape of the feasible region is, however, quite different. The limit region turns out to be an algebraic set, which we characterize as the rational image of a...